On the factorization of polynomials over discrete valuation domains
نویسنده
چکیده
We study some factorization properties for univariate polynomials with coefficients in a discrete valuation domain (A, v). We use some properties of the Newton index of a polynomial F (X) = ∑d i=0 aiX d−i ∈ A[X] to deduce conditions on v(ai) that allow us to find some information on the degree of the factors of F .
منابع مشابه
A dynamical solution of Kronecker's problem
In this paper, I present a new decision procedure for the ideal membership problem for polynomial rings over principal domains using discrete valuation domains. As a particular case, I solve a fundamental algorithmic question in the theory of multivariate polynomials over the integers called “Kronecker’s problem”, that is the problem of finding a decision procedure for the ideal membership prob...
متن کاملModule MA3412: Integral Domains, Modules and Algebraic Integers
2 Integral Domains 12 2.1 Factorization in Integral Domains . . . . . . . . . . . . . . . . 12 2.2 Euclidean Domains . . . . . . . . . . . . . . . . . . . . . . . . 14 2.3 Principal Ideal Domains . . . . . . . . . . . . . . . . . . . . . 16 2.4 Fermat’s Two Squares Theorem . . . . . . . . . . . . . . . . . 17 2.5 Maximal Ideals and Prime Ideals . . . . . . . . . . . . . . . . 20 2.6 Unique Fact...
متن کاملA Modified Digital Image Watermarking Scheme Based on Nonnegative Matrix Factorization
This paper presents a modified digital image watermarking method based on nonnegative matrix factorization. Firstly, host image is factorized to the product of three nonnegative matrices. Then, the centric matrix is transferred to discrete cosine transform domain. Watermark is embedded in low frequency band of this matrix and next, the reverse of the transform is computed. Finally, watermarked ...
متن کاملResultants and subresultants of p-adic polynomials
We address the problem of the stability of the computations of resultants and subresultants of polynomials defined over complete discrete valuation rings (e.g. Zp or k[[t]] where k is a field). We prove that Euclide-like algorithms are highly unstable on average and we explain, in many cases, how one can stabilize them without sacrifying the complexity. On the way, we completely determine the d...
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کامل